class Solution {
    public int findPeakElement(int[] arr) {
        int left=0,right=arr.length-1;
        while(left<right) {
            int mid = left+(right-left)/2;
            if(arr[mid]>arr[mid+1]) right=mid;
            else left=mid+1;
        }
        return left;
    }
}